Pricing High-Dimensional Bermudan Options using Variance-Reduced Monte Carlo Methods
نویسنده
چکیده
We present a numerical method for pricing Bermudan options depending on a large number of underlyings. The asset prices are modeled with exponential time-inhomogeneous jump-diffusion processes. We improve the least-squares Monte Carlo method proposed by Longstaff and Schwartz introducing an efficient variance reduction scheme. A control variable is obtained from a low-dimensional approximation of the multivariate Bermudan option. To this end, we adapt a model reduction method called proper orthogonal decomposition (POD), which is closely related to principal component analysis, to the case of Bermudan options. Our goal is to make use of the correlation structure of the assets in an optimal way. We compute the expectation of the control variable by either solving a low-dimensional partial integro-differential equation or by applying Fourier methods. The POD approximation can also be used as a candidate for the minimizing martingale in the dual pricing approach suggested by Rogers. We evaluate both approaches in numerical experiments.
منابع مشابه
Parallel Pricing Algorithms for Multi--Dimensional Bermudan/American Options using Monte Carlo methods
In this paper we present two parallel Monte Carlo based algorithms for pricing multi–dimensional Bermudan/American options. First approach relies on computation of the optimal exercise boundary while the second relies on classification of continuation and exercise values. We also evaluate the performance of both the algorithms in a desktop grid environment. We show the effectiveness of the prop...
متن کاملA Primal-Dual Simulation Algorithm for Pricing Multi-Dimensional American Options
This paper describes a practical algorithm based on Monte Carlo simulation for the pricing of multi-dimensional American (i.e., continuously exercisable) and Bermudan (i.e., discretelyexercisable) options. The method generates both lower and upper bounds for the Bermudan option price and hence gives valid confidence intervals for the true value. Lower bounds can be generated using any number of...
متن کاملImproved Lower and Upper Bound Algorithms for Pricing American Options by Simulation
This paper introduces new variance reduction techniques and computational improvements to Monte Carlo methods for pricing American-style options. For simulation algorithms that compute lower bounds of American option values, we apply martingale control variates and introduce the local policy enhancement, which adopts a local simulation to improve the exercise policy. For duality-based upper bou...
متن کاملPrimal-Dual Simulation Algorithm for Pricing Multidimensional American Options
T paper describes a practical algorithm based on Monte Carlo simulation for the pricing of multidimensional American (i.e., continuously exercisable) and Bermudan (i.e., discretely exercisable) options. The method generates both lower and upper bounds for the Bermudan option price and hence gives valid confidence intervals for the true value. Lower bounds can be generated using any number of pr...
متن کاملA Dynamic Look - Ahead Monte Carlo Algorithm for Pricing Bermudan Options
Under the assumption of no-arbitrage, the pricing of American and Bermudan options can be casted into optimal stopping problems. We propose a new adaptive simulation based algorithm for the numerical solution of optimal stopping problems in discrete time. Our approach is to recursively compute the so-called continuation values. They are defined as regression functions of the cash flow, which wo...
متن کامل